Domination Null and Packing Null Vertices

نویسندگان

  • Peter Johnson
  • Robert Rubalcaba
  • Matthew Walsh
چکیده

A vertex v of a graph G is domination null in G if g(v) = 0 for every minimum fractional dominating function g on G. Packing nullity is defined analogously, with reference to fractional closed neighborhood packings. We give classes of examples and examine graph operations that produce or preserve such vertices; several open problems are posed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Total Domination Number of Cartesian Product Networks

Let denote the Cartesian product of graphs and A total dominating set of with no isolated vertex is a set of vertices of such that every vertex is adjacent to a vertex in The total domination number of is the minimum cardinality of a total dominating set. In this paper, we give a new lower bound of total domination number of using parameters total domination, packing and -domination numbers of ...

متن کامل

Double-null operators and the investigation of Birkhoff's theorem on discrete lp spaces

Doubly stochastic matrices play a fundamental role in the theory of majorization. Birkhoff's theorem explains the relation between $ntimes n$ doubly stochastic matrices and permutations. In this paper, we first introduce double-null  operators and we will find some important properties of them. Then with the help of double-null operators, we investigate Birkhoff's theorem for descreate $l^p$ sp...

متن کامل

GENERALIZED FUZZY VALUED $theta$-Choquet INTEGRALS AND THEIR DOUBLE-NULL ASYMPTOTIC ADDITIVITY

The generalized fuzzy valued $theta$-Choquet integrals will beestablished for the given $mu$-integrable fuzzy valued functionson a general fuzzy measure space, and the convergence theorems ofthis kind of fuzzy valued integral are being discussed.Furthermore, the whole of integrals is regarded as a fuzzy valuedset function on measurable space, the double-null asymptoticadditivity and pseudo-doub...

متن کامل

Paired-Domination Game Played in Graphs

In this paper, we continue the study of the domination game in graphs introduced by Bre{v{s}}ar, Klav{v{z}}ar, and Rall. We study the paired-domination version of the domination game which adds a matching dimension to the game. This game is played on a graph $G$ by two players, named Dominator and Pairer. They alternately take turns choosing vertices of $G$ such that each vertex chosen by Domin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005